Generation of near-optimal universal Boolean functions
نویسندگان
چکیده
منابع مشابه
Asymptotically optimal Boolean functions
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how well Boolean functions can be approximated by linear Boolean functions. We prove that \[ \lim_{n\to\infty}2^{n/2}-\rho_n/2^{n/2-1}=1, \] which resolves a conj...
متن کاملMonotone Boolean Functions Are Universal Approximators
The employment of proper codings, such as the base-2 coding, has allowed to establish the universal approximation property of Boolean functions: if a sufficient number b of inputs (bits) is taken, they are able to approximate arbitrarily well any real Borel measurable mapping. However, if the reduced set of monotone Boolean functions, whose expression involves only and and or operators, is cons...
متن کاملContinuous Set Packing and Near-Boolean Functions
Given a family of feasible subsets of a ground set, the packing problem is to find a largest subfamily of pairwise disjoint family members. Non-approximability renders heuristics attractive viable options, while efficient methods with worst-case guarantee are a key concern in computational complexity. This work proposes a novel near-Boolean optimization method relying on a polynomial multilinea...
متن کاملNear-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O ( √ s log s). This bound is tight upto a factor of log s as the Fourier dimension and sparsity of the address function are quadratically related. We obtain the bound by observing that the Fourier dimension of a Boolean function is equivalent to its non-adaptive parity decision tree complexity, and t...
متن کاملOptimal Synthesis of Boolean Functions by Threshold Functions
We introduce a new method for obtaining optimal architectures that implement arbitrary Boolean functions using threshold functions. The standard threshold circuits using threshold gates and weights are replaced by nodes computing directly a threshold function of the inputs. The method developed can be considered exhaustive as if a solution exist the algorithm eventually will find it. At all sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80002-2